Termination w.r.t. Q proof of /tmp/tmppR9d3g/4.57.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, y, z) → g(<=(x, y), x, y, z)
g(true, x, y, z) → z
g(false, x, y, z) → f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
p(0) → 0
p(s(x)) → x

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, y, z) → g(<=(x, y), x, y, z)
g(true, x, y, z) → z
g(false, x, y, z) → f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
p(0) → 0
p(s(x)) → x

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G(false, x, y, z) → F(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
G(false, x, y, z) → P(z)
G(false, x, y, z) → F(p(x), y, z)
G(false, x, y, z) → P(x)
F(x, y, z) → G(<=(x, y), x, y, z)
G(false, x, y, z) → F(p(y), z, x)
G(false, x, y, z) → F(p(z), x, y)
G(false, x, y, z) → P(y)

The TRS R consists of the following rules:

f(x, y, z) → g(<=(x, y), x, y, z)
g(true, x, y, z) → z
g(false, x, y, z) → f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
p(0) → 0
p(s(x)) → x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

G(false, x, y, z) → F(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
G(false, x, y, z) → P(z)
G(false, x, y, z) → F(p(x), y, z)
G(false, x, y, z) → P(x)
F(x, y, z) → G(<=(x, y), x, y, z)
G(false, x, y, z) → F(p(y), z, x)
G(false, x, y, z) → F(p(z), x, y)
G(false, x, y, z) → P(y)

The TRS R consists of the following rules:

f(x, y, z) → g(<=(x, y), x, y, z)
g(true, x, y, z) → z
g(false, x, y, z) → f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
p(0) → 0
p(s(x)) → x

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 8 less nodes.